Bounds on the Power-weighted Mean Nearest Neighbor Distance
نویسندگان
چکیده
In this paper, bounds on the mean power-weighted nearest neighbor distance are derived. Previous work concentrates mainly on the infinite sample limit, whereas our bounds hold for any sample size. The results are expected to be of importance for example in statistical physics, nonparametric statistics and computational geometry, where they are related to the structure of matter as well as properties of statistical estimators and random graphs.
منابع مشابه
Mean nearest-neighbor distance in random packings of hard D-dimensional spheres.
We derive the first nontrivial rigorous bounds on the mean distance between nearest neighbors l in ergodic, isotropic packings of hard D-dimensional spheres that depend on the packing fraction and nearest-neighbor distribution function. Several interesting implications of these bounds for equilibrium as well as nonequilibrium ensembles are explored. For an equilibrium ensemble, we find accurate...
متن کاملImproving nearest neighbor classification with cam weighted distance
Nearest neighbor (NN) classification assumes locally constant class conditional probabilities, and suffers from bias in high dimensions with a small sample set. In this paper, we propose a novel cam weighted distance to ameliorate the curse of dimensionality. Different from the existing neighborhood-based methods which only analyze a small space emanating from the query sample, the proposed nea...
متن کاملConvergent Bounds on the Euclidean Distance
Given a set V of n vectors in d-dimensional space, we provide an efficient method for computing quality upper and lower bounds of the Euclidean distances between a pair of vectors in V . For this purpose, we define a distance measure, called the MS-distance, by using the mean and the standard deviation values of vectors in V . Once we compute the mean and the standard deviation values of vector...
متن کاملA New Distance-weighted k-nearest Neighbor Classifier
In this paper, we develop a novel Distance-weighted k -nearest Neighbor rule (DWKNN), using the dual distance-weighted function. The proposed DWKNN is motivated by the sensitivity problem of the selection of the neighborhood size k that exists in k -nearest Neighbor rule (KNN), with the aim of improving classification performance. The experiment results on twelve real data sets demonstrate that...
متن کاملOptimized Nearest Neighbor Methods Cam Weighted Distance & Statistical Confidence
Nearest neighbor classification methods are a useful and a relatively straightforward to implement classification technique. However, despite such appeal, they still suffer from the curse of dimensionality. Additionally, the nature of the data sets may not be wholly applicable to the model assumed in the nearest neighbor methods. As such there have been many proposed optimizations. Two such opt...
متن کامل